Three-valued k-neighborhood domination in graphs
نویسندگان
چکیده
Let k~l be an integer, and let G = (V, E) be a graph. The closed kneighborhood N k[V] of a vertex v E V is the set of vertices within distance k from v. A 3-valued function f defined on V of the form f : V --+ { -1,0, I} is a three-valued k-neighborhood dominating function if the sum of its function values over any closed k-neighborhood is at least 1. The weight of a threevalued k-neighborhood dominating function is f(V) L f( v), over all vertices v E V. The three-valued k-neighborhood domination number of a graph G, denoted Ik(G), equals the minimum weight of a three-valued k-neighborhood dominating function of G. For k ~ 2, we establish the existence of trees with three-valued k-neighborhood domination number less than any given negative number. We show that the decision problem corresponding to the problem of computing Ik is NP-complete even when restricted to bipartite graphs.
منابع مشابه
Weak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کاملOn the signed Roman edge k-domination in graphs
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
متن کاملRoman k-Tuple Domination in Graphs
For any integer $kgeq 1$ and any graph $G=(V,E)$ with minimum degree at least $k-1$, we define a function $f:Vrightarrow {0,1,2}$ as a Roman $k$-tuple dominating function on $G$ if for any vertex $v$ with $f(v)=0$ there exist at least $k$ and for any vertex $v$ with $f(v)neq 0$ at least $k-1$ vertices in its neighborhood with $f(w)=2$. The minimum weight of a Roman $k$-tuple dominatin...
متن کاملSigned total Italian k-domination in graphs
Let k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function (STIkDF) on a graph G is a functionf : V (G) → {−1, 1, 2} satisfying the conditions that $sum_{xin N(v)}f(x)ge k$ for each vertex v ∈ V (G), where N(v) is the neighborhood of $v$, and each vertex u with f(u)=-1 is adjacent to a vertex v with f(v)=2 or to two vertic...
متن کاملTotal $k$-Rainbow domination numbers in graphs
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 9 شماره
صفحات -
تاریخ انتشار 1994